Minimum degree triangulation for rectangular domains
نویسنده
چکیده
This paper describes an optimal triangulation algorithm for rectangles. We derive lower bounds on the maximum degree of triangulation, and show that our triangulation algorithm matches the lower bounds. Several important observations are also made, including a zig-zag condition that can verify whether a triangulation can minimizes the maximum degree to 4 or not. In addition, this paper identifies the necessary and sufficient condition that there exists a maximum degree 4 triangulation for convex polygons, and gives a linear time checking algorithm. 2005 Elsevier B.V. All rights reserved.
منابع مشابه
Optimizing Regular Edge Labelings
A regular edge labeling (REL) of an irreducible triangulation G uniquely defines a rectangular dual of G. Rectangular duals find applications in various areas: as floor plans of electronic chips, in architectural designs, as rectangular cartograms, or as treemaps. An irreducible triangulation can have many RELs and hence many rectangular duals. Depending on the specific application different du...
متن کاملThe Minimum Degree Heuristic and the Minimal Triangulation Process
The Minimum Degree Algorithm, one of the classical algorithms of sparse matrix computations, is a heuristic for computing a minimum triangulation of a graph. It is widely used as a component in every sparse matrix package, and it is known to produce triangulations with few ll edges in practice, although no theoretical bound or guarantee has been shown concerning the amount of ll it introduces. ...
متن کاملFast minimal triangulation algorithm using minimum degree criterion
We propose an algorithm for minimal triangulation which, using simple and efficient strategy, subdivides the input graph in different, almost non-overlapping, subgraphs. Using the technique of matrix multiplication for saturating the minimal separators, we show that the partition of the graph can be computed in time O(n) where n is the time required by the binary matrix multiplication. After sa...
متن کاملGenerating triangulations on closed surfaces with minimum degree at least 4
We show that every triangulation on a closed surface, except the sphere, with minimum degree at least 4 can be obtained from an irreducible triangulation by two kinds of local deformations, called 4-splitting and addition of an octahedron and that every triangulation on the sphere can be obtained from the octahedron by them. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملTight degree bounds for pseudo-triangulations of points
We show that every set of n points in general position has a minimum pseudo-triangulation whose maximum vertex degree is five. In addition, we demonstrate that every point set in general position has a minimum pseudo-triangulation whose maximum face degree is four (i.e. each interior face of this pseudo-triangulation has at most four vertices). Both degree bounds are tight. Minimum pseudo-trian...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 96 شماره
صفحات -
تاریخ انتشار 2005